Separation Theorems for Simplicity 26-Surfaces
نویسندگان
چکیده
The main goal of this paper is to prove a Digital Jordan– Brouwer Theorem and an Index Theorem for simplicity 26-surfaces. For this, we follow the approach to Digital Topology introduced in [2], and find a digital space such that the continuous analogue of each simplicity 26-surface is a combinatorial 2-manifold. Thus, the separation theorems quoted above turn out to be an immediate consequence of the general results obtained in [2] and [3] for arbitrary digital n-manifolds.
منابع مشابه
Simplicity Surfaces: a New Deenition of Surfaces in Z 3
In this paper, we introduce a new notion of surfaces in Z 3 , called simplicity surfaces. In the continuous space, a surface is characterized by the fact that the neighborhood of each point of the surface is homeomorphic to an Euclidean disc. The chosen approach consists in characterizing a surface in Z 3 by the condition that the neighborhood of any point constitutes a simple closed curve. The...
متن کاملA Digital Index Theorem
This paper is devoted to prove a Digital Index Theorem for digital (n − 1)-manifolds in a digital space (Rn, f), where f belongs to a large family of lighting functions on the standard cubical decomposition Rn of the n-dimensional Euclidean space. As an immediate consequence we obtain the corresponding theorems for all (α, β)-surfaces of Kong-Roscoe, with α, β ∈ {6, 18, 26} and (α, β) 6= (6, 6)...
متن کاملDigital cohomology groups of certain minimal surfaces
In this study, we compute simplicial cohomology groups with different coefficients of a connected sum of certain minimal simple surfaces by using the universal coefficient theorem for cohomology groups. The method used in this paper is a different way to compute digital cohomology groups of minimal simple surfaces. We also prove some theorems related to degree properties of a map on digital sph...
متن کاملContact Geometry
2 Contact manifolds 4 2.1 Contact manifolds and their submanifolds . . . . . . . . . . . . . . 6 2.2 Gray stability and the Moser trick . . . . . . . . . . . . . . . . . . 13 2.3 Contact Hamiltonians . . . . . . . . . . . . . . . . . . . . . . . . . 16 2.4 Darboux’s theorem and neighbourhood theorems . . . . . . . . . . 17 2.4.1 Darboux’s theorem . . . . . . . . . . . . . . . . . . . . . . . 17...
متن کاملResearch of Blind Signals Separation with Genetic Algorithm and Particle Swarm Optimization Based on Mutual Information
Blind source separation technique separates mixed signals blindly without any information on the mixing system. In this paper, we have used two evolutionary algorithms, namely, genetic algorithm and particle swarm optimization for blind source separation. In these techniques a novel fitness function that is based on the mutual information and high order statistics is proposed. In order to evalu...
متن کامل